Cuba—a library for multidimensional numerical integration
نویسندگان
چکیده
منابع مشابه
Cuba - a library for multidimensional numerical integration
The Cuba library provides new implementations of four general-purpose multi-dimensional integration algorithms: Vegas, Suave, Divonne, and Cuhre. Suave is a new algorithm, Divonne is a known algorithm to which important details have been added, and Vegas and Cuhre are new implementations of existing algorithms with only few improvements over the original versions. All four algorithms can integr...
متن کاملNumerical integration of nonlinear multidimensional systems
The suitability of methods from multidimensional systems theory and digital signal processing for the e cient simulation of time and space dependent problems has already been demonstrated. Properly chosen functional transformations for the time and space coordinates turn a partial di erential equation into a transfer function description of a multidimensional continuous system. It serves as the...
متن کاملFiEstAS sampling -- a Monte Carlo algorithm for multidimensional numerical integration
This paper describes a new algorithm for Monte Carlo integration, based on the Field Estimator for Arbitrary Spaces (FiEstAS). The algorithm is discussed in detail, and its performance is evaluated in the context of Bayesian analysis, with emphasis on multimodal distributions with strong parameter degeneracies. Source code is available upon request.
متن کاملThe Existence of Efficient Lattice Rules for Multidimensional Numerical Integration
In this contribution to the theory of lattice rules for multidimensional numerical integration, we first establish bounds for various efficiency measures which lead to the conclusion that in the search for efficient lattice rules one should concentrate on lattice rules with large first invariant. Then we prove an existence theorem for efficient lattice rules of rank 2 with prescribed invariants...
متن کاملParallel Algorithms for Multidimensional Integration
A central feature of adaptive algorithms for the numerical approximation of deenite integrals is the manipulation of the list containing the sub-intervals and corresponding error estimates. Fundamentally diierent parallel algorithms result depending on whether the list is maintained as a single shared data structure accessible to all processors, or else as the union of non-overlapping sublists,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2005
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2005.01.010